package qianxin;
import java.util.ArrayDeque;
import java.util.Queue;

/**
 * @author Hang
 * @date 2022/8/25
 * @project AutumnOffer
 * @description
 **/
public class solution1 {
    public static int DagPathNum (int[][] nodes) {
        // write code here
        int count = 0;
        Queue<Integer> queue = new ArrayDeque<>();
        for(int i=0;i<nodes[0].length;i++){
            boolean dfs = dfs(nodes, 0, i);

        }
        while(!queue.isEmpty()){
            Integer res = queue.poll();
//            if(dfs(nodes,))
        }
        return 0;
    }
    public static boolean dfs(int[][] nodes,int x,int y){
        return false;
    }
}
